Tuning Constraint-Based Communication in Distributed Problem Solving
نویسندگان
چکیده
Distributed Problem Solving (DPS) decomposes problems into subproblems to be solved by interacting, cooperative software agents. Thus, DPS is suitable for modeling, in the context of parallel and distributed architectures, the solving of problems characterized by many inter-dependencies among subproblems. Concurrent Constraint Programming (CCP) provides a powerful execution framework for DPS, where constraints can declaratively implement both local problem solving as well as exchange of information, and hence DPS, among agents. To optimize DPS, the protocol for constraint communication must be tuned to the specific kind of DPS problem and the characteristics of the underlying system architecture. In this paper, we provide a formal framework for modeling different options and we show how it applies to concrete, generalizable examples.
منابع مشابه
Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملAutomatic tuning of a behavior-based guidance algorithm for formation flight of quadrotors
This paper presents a tuned behavior-based guidance algorithm for formation flight of quadrotors. The behavior-based approach provides the basis for the simultaneous realization of different behaviors such as leader following and obstacle avoidance for a group of agents; in our case they are quadcopters. In this paper optimization techniques are utilized to tune the parameters of a behavior-bas...
متن کامل12th IEEE International Conference on Distributed Computing Systems '92, pp.614{621 Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملHeuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heu...
متن کاملProblem Structure and Subproblem Sharing in Multi-Agent Systems
In multi-agent problem-solving systems in which agents work asynchronously and in parallel on parts of a problem distributed among them, subproblem communication and integration protocols can have a major impact on problem solving efficiency. Transmitting too soon can necessitate having to “take back” transmitted partial solutions, wasting communication and processing time. Transmitting too lat...
متن کامل